On Maximal Level Minimal Path Vectors of a Two-Terminal Network
نویسندگان
چکیده
The reliability of a two-terminal flow network with a discrete set of possible capacities for its arcs is usually computed in terms of minimal path or minimal cut vectors. This paper analyzes the connection between minimal path vectors and flow functions, which supports the development of an efficient algorithm that solves the problem of finding the set of all such vectors.
منابع مشابه
A modified NSGA-II solution for a new multi-objective hub maximal covering problem under uncertain shipments
Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and v...
متن کاملA Simple Algorithm to Find All Minimal Path Vectors to Demand Level d in a Stochastic-Flow Network
Many real-life systems such as manufacturing, telecommunication and transportation systems may be regarded as a stochastic-flow network whose arcs have independent integer-value random capacities. System reliability of such a system can be computed in terms of minimal path vectors to demand level d, called d-MinPaths (d-MPs) or minimal cut vectors to demand level d, called d-MinCuts (d-MCs). Th...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملA Local Hierarchy Theory for Acyclic Digraphs
Keywords--Local hierarchy theory, Global hierarchy theory, Acyclic digraphs, Generalized Lorenz curve, Citation analysis, Organizational charts. 1. I N T R O D U C T I O N In this article, we complement the global hierarchy theory (in short: GHT) (studied in [1]) by a local theory, referred to as local hierarchy theory (in short: LHT). Global as well as local hierarchy theory can be used in stu...
متن کاملStochastic bounds on distributions of optimal value functions with applications to pert, network flows and reliability
Meilijson and Nadas [1979] have obtained stochastic bounds in the convex majorisation sense to the critical path length of a project network with random activity durations. In this paper we present those results in a more general framework and, using similar techniques, obtain bounds for shortest route, maximal flow and reliability system lifetime. Subject classification: #488 Bounds for stocha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014